Generalized shift-splitting preconditioners for nonsingular and singular generalized saddle point problems
نویسندگان
چکیده
منابع مشابه
Preconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملPreconditioners for Generalized Saddle-Point Problems
We propose and examine block-diagonal preconditioners and variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. That is, we consider the nonsymmetric, nonsingular case where the (2,2) block is small in norm, and we are particularly concerned with the case where the (1,2) block is different from the transposed (2,1) block. We provide theoretical and exper...
متن کاملOn the generalized shift-splitting preconditioner for saddle point problems
In this paper, the generalized shift-splitting preconditioner is implemented for saddle point problems with symmetric positive definite (1,1)-block and symmetric positive semidefinite (2,2)-block. The proposed preconditioner is extracted form a stationary iterative method which is unconditionally convergent. Moreover, a relaxed version of the proposed preconditioner is presented and some proper...
متن کاملA modification of the generalized shift-splitting method for singular saddle point problems
A modification of the generalized shift-splitting (GSS) method is presented for solving singular saddle point problems. In this kind of modification, the diagonal shift matrix is replaced by a block diagonal matrix which is symmetric positive definite. Semiconvergence of the proposed method is investigated. The induced preconditioner is applied to the saddle point problem and the preconditioned...
متن کاملPerformance Comparison of Relaxation Methods with Singular and Nonsingular Preconditioners for Singular Saddle Point Problems
In this paper, we first review the PU and Uzawa-SAOR relaxation methods with singular or nonsingular preconditioning matrices for solving singular saddle point problems, and then we provide numerical experiments to compare performance results of the relaxation iterative methods using nonsingular preconditioners with those using singular preconditioners. Mathematics Subject Classification: 65F10...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2016
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2016.05.022